Knapsack problems — An overview of recent advances. Part I: Single knapsack problems

After the seminal books by Martello and Toth (1990) Kellerer, Pferschy, Pisinger (2004), knapsack problems became a classical rich research area in combinatorial optimization. The purpose of this survey, which is structured two parts, to cover developments that appeared field after publication latter volume. Part I devoted whose goal optimally assign items single knapsack. Besides (binary, subset sum, bounded, unbounded, change-making), we review with special constraints (setups, multiple-choice, conflicts, precedences, sharing, compartments) as well relatively recent fields investigation, like robust bilevel problems. subsequent II covers multiple, multidimensional, quadratic problems, includes succinct treatment online multiobjective